A Global Convergence Proof for Cyclic Jacobi Methods with Block Rotations
نویسنده
چکیده
This paper introduces a globally convergent block (column– and row–) cyclic Jacobi method for diagonalization of Hermitian matrices and for computation of the singular value decomposition of general matrices. It is shown that a block rotation (generalization of the Jacobi’s 2× 2 rotation) must be computed and implemented in a particular way to guarantee global convergence. This solves a long standing open problem of convergence of block cyclic Jacobi methods. The proof includes the convergence of the eigenspaces in the general case of multiple eigenvalues.
منابع مشابه
A global convergence proof of cyclic Jacobi methods with block rotations LAPACK Working Note 196
This paper introduces a globally convergent block (column– and row–) cyclic Jacobi method for diagonalization of Hermitian matrices and for computation of the singular value decomposition of general matrices. It is shown that a block rotation (generalization of the Jacobi’s 2× 2 rotation) must be computed and implemented in a particular way to guarantee global convergence. This solves a long st...
متن کاملHamilton and Jacobi Meet Again: Quaternions and the Eigenvalue Problem
The algebra isomorphism between M 4 (R) and HHH, where H is the algebra of quaternions, has unexpected computational payoo: it helps construct an orthogonal similarity that 22 block-diagonalizesa 44 symmetricmatrix. Replacing plane rotations with these more powerful 4 4 rotations leads to a quaternion-Jacobi method in which thèweight' of 4 elements (in a 2 2 block) is transferred all at once on...
متن کاملGeneralized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملPivot Selection Strategies in Jacobi Joint Block-Diagonalization
A common problem in independent component analysis after prewhitening is to optimize some contrast on the orthogonal or unitary group. A popular approach is to optimize the contrast only with respect to a single angle (Givens rotation) and to iterate this procedure. In this paper we discuss the choice of the sequence of rotations for such so-called Jacobi-based techniques, in the context of joi...
متن کاملOn Asymptotic Convergence of Nonsymmetric Jacobi Algorithms
The asymptotic convergence behavior of cyclic versions of the nonsymmetric Jacobi algorithm for the computation of the Schur form of a general complex matrix is investigated. Similar to the symmetric case, the nonsymmetric Jacobi algorithm proceeds by applying a sequence of rotations that annihilate a pivot element in the strict lower triangular part of the matrix until convergence to the Schur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 31 شماره
صفحات -
تاریخ انتشار 2009